/* Benchmarks for the PionterC verifier. */

// tree visit

struct tree
{
  int data;
  struct tree* l;
  struct tree* r;
};

/*@ let tree(t) = (t==null) ||
  @  	          (({t}) && tree(t->l) && tree(t->l))
  @ in  tree(t)
  @ end
  @*/
void pre_order_walk(struct tree * t)
{
  if(t!=null)
  {
    //    print(t->data);
    pre_order_walk(t->l);
    pre_order_walk(t->r);
  }
  return;
}
/*@ tree(t) */
